Asymptotic Waveform Evaluation via a Restarted Lanczos Method

نویسندگان

  • Kyle Gallivan
  • Eric Grimme
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Waveform Evaluation via a Lanczos Method

In this paper we show that the two-sided Lanczos procedure combined with implicit restarts, offers significant advantages over Pad6 approximations used typically for model reduction in circuit simulation. Keywords-Dynamical systems, Model reduction, Numerical methods, Pad6 approximation, Lanczos algorithm.

متن کامل

Asymptotic Waveform Evaluation via aLanczos

|In this paper we show that the two-sided Lanczos procedure combined with implicit restarts ooers signiicant advantages over Pad e approximations used typically for model reduction in circuit simulation.

متن کامل

Nested Lanczos : Implicitly Restarting a Lanczos Algorithm Nested Lanczos : Implicitly Restarting a Lanczos Algorithm

In this text, we present a generalisation of the idea of the Implicitly Restarted Arnoldi method to the nonsymmetric Lanczos algorithm, using the two-sided Gram-Schmidt process or using a full Lanczos tridi-agonalisation. The Implicitly Restarted Lanczos method can be combined with an implicit lter. It can also be used in case of breakdown and ooers an alternative for look-ahead.

متن کامل

An Implicitly Restarted Symplectic Lanczos Method for the Symplectic Eigenvalue Problem

An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is presented. The Lanczos vectors are constructed to form a symplectic basis. The inherent numerical diiculties of the symplectic Lanczos method are addressed by inexpensive implicit restarts. The method is used to compute some eigenvalues and eigenvectors of large and sparse symplectic matrices.

متن کامل

Thick-Restart Lanczos Method for Symmetric Eigenvalue Problems

For real symmetric eigenvalue problems, there are a number of algorithms that are mathematically equivalent, for example, the Lanczos algorithm, the Arnoldi method and the unpreconditioned Davidson method. The Lanczos algorithm is often preferred because it uses signiicantly fewer arithmetic operations per iteration. To limit the maximum memory usage, these algorithms are often restarted. In re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994